Cryptographic Treatment of Private User Profiles

نویسندگان

  • Felix Günther
  • Mark Manulis
  • Thorsten Strufe
چکیده

The publication of private data in user profiles in a both secure and private way is a rising problem and of special interest in, e.g., online social networks that become more and more popular. Current approaches, especially for decentralized networks, often do not address this issue or impose large storage overhead. In this paper, we present a cryptographic approach to private profile management that is seen as a building block for applications in which users maintain their own profiles, publish and retrieve data, and authorize other users to access different portions of data in their profiles. In this course, we provide: (i) formalization of confidentiality and unlinkability as two main security and privacy goals for the data which is kept in profiles and users who are authorized to retrieve this data, and (ii) specification, analysis, and comparison of two private profile management schemes based on different encryption techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hidden Pairings and Trapdoor DDH Groups

This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public description that allows a user to compute a restricted set of operations, and a private description that allows a greater set of operations to be computed. We will concentrate on the case where the public description all...

متن کامل

پروتکل کارا برای جمع چندسویه امن با قابلیت تکرار

In secure multiparty computation (SMC), a group of users jointly and securely computes a mathematical function on their private inputs, such that the privacy of their private inputs will be preserved. One of the widely used applications of SMC is the secure multiparty summation which securely computes the summation value of the users’ private inputs. In this paper, we consider a secure multipar...

متن کامل

Slightly Improved Merkle Tree Traversal for User Authentication Using Pseudorandomly-Generated Leaves

Merkle trees can be used for a variety of cryptographic purposes, including digital signatures and user authentication. We describe a technique for pseudorandomly generating the private values corresponding to the leaves of a Merkle tree from a common seed. The technique allows for secure user authentication with fewer hash function evaluations required to generate the authentication data. Usin...

متن کامل

2015 5th International Conference on IT Convergence and Security (ICITCS)

This paper proposes a new double-private protocol for fuzzy matching and -fuzzy matching. Many works have been done for private database search in which the keyword that a user inputs for the search is concealed to the database owner. In these database searches, the exactly matched data are returned to the user. Fuzzy matching has been proposed in which not exactly matched but nearly matched da...

متن کامل

Extended Private Information Retrieval and Its Application in Biometrics Authentications

In this paper we generalize the concept of Private Information Retrieval (PIR) by formalizing a new cryptographic primitive, named Extended Private Information Retrieval (EPIR). Instead of enabling a user to retrieve a bit (or a block) from a database as in the case of PIR, an EPIR protocol enables a user to evaluate a function f which takes a string chosen by the user and a block from the data...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011